package jingdong;

import java.util.HashMap;
import java.util.Scanner;

/**
 * @author Hang
 * @date 2022/8/27
 * @project AutumnOffer
 * @description
 **/
public class Solution2 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] res = new int[n];
        for(int i=0;i<n;i++){
            res[i] = sc.nextInt();
        }
        HashMap<Integer, Integer> map1 = new HashMap<>();
        HashMap<Integer, Integer> map2 = new HashMap<>();
        for(int i=0;i<n;i++){
            if(i%2==0){
                map1.put(res[i], map1.getOrDefault(res[i],0)+1);
            }else{
                map2.put(res[i],map2.getOrDefault(res[i],0)+1);
            }
        }
        int max1 = 0,max2 = 0;
        for(Integer i: map1.keySet()){
            if(max1 < map1.get(i)){
                max1 = map1.get(i);
            }
        }
        for(Integer i: map2.keySet()){
            if(max2 < map2.get(i)){
                max2 = map2.get(i);
            }
        }
        System.out.println(n-max1-max2);
    }
}
